Triangle Mesh Compression using B-Spline Curves
نویسندگان
چکیده
Abstract We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivity). The method is loosely based on the Edgebreaker algorithm by Rossignac et al. in the sense that the traversal of the mesh is done the same way during compression. We use B-Spline curves to store, compute and predict the geometry or the vertices. We do not need to store the connectivity in our method unlike Edgebreaker. The resulting compressed files are roughly 10% smaller than that from Edgebreaker.
منابع مشابه
Discrete Fairing of Curves and Surfaces Based on Linear Curvature Distribution
In the planar case, one possibility to create a high quality curve that interpolates a given set of points is to use a clothoid spline, which is a curvature continuous curve with linear curvature segments. In the rst part of the paper we develop an e cient fairing algorithm that calculates the discrete analogon of a closed clothoid spline. In the second part we show how this discrete linear cur...
متن کاملA multiple B-Spline representation for progressive 3D mesh compression
This paper proposes a new progressive compression scheme for 3D triangular meshes, based on a multipatch B-Spline representation. First, the mesh is segmented into multiple patches. Each patch is then parameterized, and approximated by a B-Spline surface. The B-Spline control points are stored into 2D images and compressed using optimized still image encoders. The initial mesh topology is lossl...
متن کاملModélisation géométrique de surfaces lisses: Design et Fairing. (Geometric modeling of smooth surfaces: Design and Fairing)
A piecewise quintic G1 spline surface interpolating the vertices of a triangular surface mesh of arbitrary topological type is presented. The surface has an explicit triangular Bézier representation, is affine invariant and has local support. The twist compatibility problem which arises when joining an even number of polynomial patches G1 continuously around a common vertex is solved by constru...
متن کاملB-spline Patches Fitting on Surfaces and Triangular Meshes
In this paper a technique for the construction of quartic polynomial B-spline patches fitting on analytical surfaces and triangle meshes is presented. The input data are curvature values and principal directions at a given surface point which can be computed directly, if the surface is represented by a vector function. In the case of discrete surface representation, i.e. on a triangle mesh the ...
متن کاملOptimal Bit Allocation in 3D Compression
To use 3D models on the Internet or in other bandwidth-limited applications, it is often necessary to compress their triangle mesh representations. We consider the problem of balancing two forms of lossy mesh compression: reduction of the number of vertices by simplification, and reduction of the number of bits of resolution used per vertex coordinate via quantization. Let A be a triangle mesh ...
متن کامل